A class of infinite dimensional linear programming problems
نویسندگان
چکیده
منابع مشابه
A goal programming approach for fuzzy flexible linear programming problems
We are concerned with solving Fuzzy Flexible Linear Programming (FFLP) problems. Even though, this model is very practical and is useful for many applications, but there are only a few methods for its situation. In most approaches proposed in the literature, the solution process needs at least, two phases where each phase needs to solve a linear programming problem. Here, we propose a method t...
متن کاملDuality in infinite dimensional linear programming
We consider the class of linear programs with infinitely many variables and constraints having the property that every constraint contains at most finitely many variables while every variable appears in at most finitely many constraints. Examples include production planning and equipment replacement over an infinite horizon. We form the natural dual linear programming problem and prove strong d...
متن کاملShadow Prices in Infinite-Dimensional Linear Programming
We consider the class of linear programs that can be formulated with infinitely many variables and constraints but where each constraint has only finitely many variables. This class includes virtually all infinite horizon planning problems modeled as infinite stage linear programs. Examples include infinite horizon production planning under time-varying demands and equipment replacement under t...
متن کاملSemi-infinite linear programming approaches to semidefinite programming problems∗
Interior point methods, the traditional methods for the SDP , are fairly limited in the size of problems they can handle. This paper deals with an LP approach to overcome some of these shortcomings. We begin with a semi-infinite linear programming formulation of the SDP and discuss the issue of its discretization in some detail. We further show that a lemma due Pataki on the geometry of the SDP...
متن کاملA Class of Linear Programming Problems Requiring A
; A coordinate-free description of the simplex algorithm (for nondegenerate linear programming problems) is supplied, and is used to show that the number of iterations can be larger than was previously knovm» For 0 < m < n, there is constructed a nondegenerate linear programming problem whose bounded (n m)-dimensional feasible region is defined by means of m linear equality constraints in n non...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Journal of Mathematical Analysis and Applications
سال: 1982
ISSN: 0022-247X
DOI: 10.1016/0022-247x(82)90163-9